An intuitionistic proof of Kruskal?s theorem

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ileantap: an Intuitionistic Theorem Prover Ileantap: an Intuitionistic Theorem Prover

We present a Prolog program that implements a sound and complete theorem prover for rst-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string uniica-tion to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the diierent logical connectives the implementation can easily be adapted to deal with other n...

متن کامل

Another proof of Banaschewski's surjection theorem

We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...

متن کامل

ileanTAP: An Intuitionistic Theorem Prover

We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string unification to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the different logical connectives the implementation can easily be adapted to deal with othe...

متن کامل

An Intuitionistic Version of Cantor's Theorem

An intuitionistic version of Cantor’s theorem, which shows that there is no surjective function from the type of the natural numbers N into the type N → N of the functions from N into N , is proved within MartinLöf’s Intuitionistic Type Theory with the universe of the small types. Mathematics Subject Classification: 03B15, 03B20.

متن کامل

An Algebraic Proof of Deuber's Theorem

Deuber’s Theorem says that, given any m, p, c, r in N, there exist n, q, μ in N such that whenever an (n, q, c)-set is r-coloured, there is a monochrome (m, p, c)-set. This theorem has been used in conjunction with the algebraic structure of the StoneČech compactification βN of N to derive several strengthenings of itself. We present here an algebraic proof of the main results in βN and derive ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archive for Mathematical Logic

سال: 2004

ISSN: 0933-5846,1432-0665

DOI: 10.1007/s00153-003-0207-x